prioritizing interrupt causes in minimally-invasive surgeries based on identifying causal relations between interrupt causes
نویسندگان
چکیده
laparoscopy or minimally-invasive surgery is a surgical technique in which the surgical operations are performed via a few small incisions. this kind of surgery has fewer complications over open surgery. finding methods for shortening the time of laparoscopic surgeries can improve operating room efficiency. an approach to shortening the time of laparoscopic surgeries is identifying the interruptions in these surgeries and preventing from their occurrence or reducing the potential of occurrence of the identified interrupt causes. in this paper, the interrupt causes of laparoscopic surgeries are prioritized based on the identified causal relations between interrupt causes. research population is the laparoscopic surgeries performed in hasheminezhad kidney center in may-june 2013. for this purpose, 25 laparoscopic surgeries are observed in this hospital in this time interval. causal relations among interrupt causes are identified from the gathered data. the main causes are identified and ranked based on fuzzy topsis method. for prioritizing the interrupt causes, frequency of occurrence, average length, severity degree, the potential of reducing interrupt occurrence and the potential of preventing interrupt occurrence are considered.experimental results show that the most important interrupt causes in laparoscopic surgeries are staff shortage or multi-tasking staff, foggy lens, unavailable surgical instruments, dirty lens and finally low-experienced staff. moreover, sensitivity analysis on criteria weighting show that the mentioned interrupt causes are the five most-important interrupt causes in more than 80% of the evaluated scenarios.preventing the occurrence of the most-important interrupt causes can improve the surgical time. if it is not possible, reducing the average length of interrupts caused by the identified main causes can be considered for improvement of the operating room efficiency.
منابع مشابه
Setting Interrupt Priorities in Software via Interrupt Queueing
When hardware intemrpt priorities don't match the needs of software, operating system designers often just suffer in silence. '!Ve describe an alternative here: simulating the hardware priority interrupt queueing mechanism in software, but assigning the (software) intemrpt priorities as we wish. This was done on an AMD 29200 microconffoller [Advanced Micro Devices 19941 which has effectively on...
متن کاملVerification on Interrupt Timed Automata
The class of Interrupt Timed Automata (ITA) has been introduced to model multi-task systems with interruptions in a single processor environment. This is a subclass of hybrid automata in which real valued variables consist of a restricted type of stopwatches (variables with rate 0 or 1) organized along levels. While reachability is undecidable with usual stopwatches, it was proved that this pro...
متن کاملPolynomial Interrupt Timed Automata
Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (PolITA). We prove that reachability is decidable in 2EX...
متن کاملParametric Interrupt Timed Automata
Parametric reasoning is particularly relevant for timed models, but very often leads to undecidability of reachability problems. We propose a parametrised version of Interrupt Timed Automata (an expressive model incomparable to Timed Automata), where polynomials of parameters can occur in guards and updates. We prove that different reachability problems, including robust reachability, are decid...
متن کاملA Typed Interrupt Calculus
Most real-time systems require responsive interrupt handling. Programming of interrupt handlers is challenging: in order to ensure responsiveness, it is often necessary to have interrupt processing enabled in the body of lower priority handlers. It would be a programming error to allow the interrupt handlers to interrupt each other in a cyclic fashion; it could lead to an unbounded stack. Until...
متن کاملInterrupt Timed Automata
In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single processor environment. This model is a subclass of hybrid automata. While reachability is undecidable for hybrid automata we show that in ITA the reachability problem is in 2EXPSPACE and in PSPACE when the number of clocks is fixed...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۹، شماره ۱، صفحات ۳۳-۴۳
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023